An algorithm for the determination of a longest increasing subsequence in a sequence
نویسندگان
چکیده
منابع مشابه
A fast algorithm for computing a longest common increasing subsequence
Let A = 〈a1, a2, . . . , am〉 and B = 〈b1, b2, . . . , bn〉 be two sequences, where each pair of elements in the sequences is comparable. A common increasing subsequence of A and B is a subsequence 〈ai1 = bj1 , ai2 = bj2 , . . . , ail = bjl 〉, where i1 < i2 < · · · < il and j1 < j2 < · · · < jl , such that for all 1 k < l, we have aik < aik+1 . A longest common increasing subsequence of A and B i...
متن کاملThe Longest Almost-Increasing Subsequence
Given a sequence of n elements, we introduce the notion of an almost-increasing subsequence as the longest subsequence that can be converted to an increasing subsequence by possibly adding a value, that is at most a fixed constant, to each of the elements. We show how to optimally construct such subsequence in O(n log k) time, where k is the length of the output subsequence.
متن کاملPath algebra algorithm for finding longest increasing subsequence
New algorithm for finding longest increasing subsequence is discussed. This algorithm is based on the ideas of idempotent mathematic and uses Max-Plus idempotent semiring. Problem of finding longest increasing subsequence is reformulated in a matrix form and solved with linear algebra.
متن کاملChapter 33 Longest Increasing Subsequence
In this paper we will investigate the connection between random matrices and finding the longest increasing subsequence of a permutation. We will introduce a model for the problem using a simple card game. Then we will talk about Young tableaux and their relation to the symmetric group. Representation theory and power-sum symmetric functions serve as the bridge between this combinatorial constr...
متن کاملA Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem
A longest increasing subsequence problem (LIS) is a well-known combinatorial problem with applications mainly in bioinformatics, where it is used in various projects on DNA sequences. Recently, a number of generalisations of this problem were proposed. One of them is to find an LIS among all fixed-size windows of the input sequence (LISW). We propose an algorithm for the LISW problem based on c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1989
ISSN: 0898-1221
DOI: 10.1016/0898-1221(89)90036-9